Corrigendum to ‘Algebraic characterizations of regularity
نویسندگان
چکیده
The authors regret a flaw in the proof of a result in our paper [1] cited in the title. They would like to apologize for any inconvenience caused. This corrigendum provides corrected statements and proofs of such a result. (For theoretical background on the subject, see, for instance, Cvetković, Doob, and Sachs [5], Biggs [2], Brouwer, Cohen, and Neumaier [3], Brouwer and Haemers [4], Van Dam, Koolen, and Tanaka [6], Fiol [7], and Godsil and Royle [8].)
منابع مشابه
Regularity in residuated lattices
In this paper, we study residuated lattices in order to give new characterizations for dense, regular and Boolean elements in residuated lattices and investigate special residuated lattices in order to obtain new characterizations for the directly indecomposable subvariety of Stonean residuated lattices. Free algebra in varieties of Stonean residuated lattices is constructed. We introduce in re...
متن کاملCombinatorial vs. Algebraic Characterizations of Pseudo-Distance-Regularity Around a Set
Given a simple connected graph Γ and a subset of its vertices C, the pseudodistance-regularity around C generalizes, for not necessarily regular graphs, the notion of completely regular code. Up to know, most of the characterizations of pseudodistance-regularity has been derived from a combinatorial definition. In this paper we propose an algebraic (Terwilliger-like) approach to this notion, sh...
متن کاملar X iv : 1 20 2 . 32 65 v 1 [ m at h . C O ] 1 5 Fe b 20 12 On Almost Distance - Regular Graphs ∗
Distance-regular graphs are a key concept in Algebraic Combinatorics and have given rise to several generalizations, such as association schemes. Motivated by spectral and other algebraic characterizations of distance-regular graphs, we study ‘almost distance-regular graphs’. We use this name informally for graphs that share some regularity properties that are related to distance in the graph. ...
متن کاملOn almost distance-regular graphs
Distance-regular graphs have been a key concept in Algebraic Combinatorics and have given place to several generalizations, such as association schemes. Motivated by spectral and other algebraic characterizations of distance-regular graphs, we study ‘almost distance-regular graphs’. We use this name informally for graphs that share some regularity properties that are related to distance in the ...
متن کامل$(m,n)$-Hyperideals in Ordered Semihypergroups
In this paper, first we introduce the notions of an $(m,n)$-hyperideal and a generalized $(m,n)$-hyperideal in an ordered semihypergroup, and then, some properties of these hyperideals are studied. Thereafter, we characterize $(m,n)$-regularity, $(m,0)$-regularity, and $(0,n)$-regularity of an ordered semihypergroup in terms of its $(m,n)$-hyperideals, $(m,0)$-hyperideals and $(0,n)$-hyperideal...
متن کامل